Weakness of F36⋅1429 and F24⋅3041 for discrete logarithm cryptography
نویسندگان
چکیده
منابع مشابه
Weakness of F36·509 for Discrete Logarithm Cryptography
In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented new algorithms for computing discrete logarithms in finite fields of small and medium characteristic. We show that these new algorithms render the finite field F36·509 = F33054 weak for discrete logarithm cryptography in the sense that discrete logarithms in this field can be computed significantly faster than with the previo...
متن کاملWeakness of 𝔽36·509 for Discrete Logarithm Cryptography
In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented new algorithms for computing discrete logarithms in finite fields of small and medium characteristic. We show that these new algorithms render the finite field F36·509 = F33054 weak for discrete logarithm cryptography in the sense that discrete logarithms in this field can be computed significantly faster than with the previo...
متن کاملWeakness of 𝔽66·1429 and 𝔽24·3041 for discrete logarithm cryptography
In 2013, Joux and then Barbulescu et al. presented new algorithms for computing discrete logarithms in finite fields of small characteristic. Shortly thereafter, Adj et al. presented a concrete analysis showing that, when combined with some steps from classical algorithms, the new algorithms render the finite field F36·509 weak for pairing-based cryptography. Granger and Zumbrägel then presente...
متن کاملCompressing and Disguising Elements in Discrete Logarithm Cryptography
In the modern world, the ubiquity of digital communication is driven by the constantly evolving world of cryptography. Consequently one must efficiently implement asymmetric cryptography in environments which have limited resources at their disposal, such as smart–cards, ID cards, vehicular microchips and many more. It is the primary purpose of this thesis to investigate methods for reducing th...
متن کاملAttacks on Elliptic Curve Cryptography Discrete Logarithm Problem ( EC - DLP )
This paper provides an overview of elliptic curves and their use in cryptography. The purpose of this paper is an in-depth examination of the Elliptic Curve Discrete Logarithm (ECDLP) including techniques in attacking cryptosystems dependent on the ECDLP. The paper includes properties of elliptic curve and methods for various attacks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2015
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2014.10.009